Reduced‐order FFT‐based homogenisation by tensor approximation
نویسندگان
چکیده
منابع مشابه
Tensor Approximation by Matrix Techniques
Tensor approximation is a rapidly developing topic due to many applications in data analysis and high-dimensional problems. Moreover, tensor is a very useful kind of nonlinear structure that can be successfully used in addition and in combination with conventional types of linear structure in matrices. We consider new approaches involving classical matrix techniques and demonstrate some applica...
متن کاملLow-rank Tensor Approximation
Approximating a tensor by another of lower rank is in general an ill posed problem. Yet, this kind of approximation is mandatory in the presence of measurement errors or noise. We show how tools recently developed in compressed sensing can be used to solve this problem. More precisely, a minimal angle between the columns of loading matrices allows to restore both existence and uniqueness of the...
متن کاملDynamical Tensor Approximation
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be viewed as a continuous-time updating procedure. This approach works with the increments rather than the full tensor and avoids the computation of decompositions of large matrices. In this method, the derivative is pro...
متن کاملDiscrete Geometric Homogenisation and Inverse Homogenisation of an Elliptic Operator
We show how to parameterise a homogenised conductivity in R2 by a scalar function s(x), despite the fact that the conductivity parameter in the related up-scaled elliptic operator is typically tensor valued. Ellipticity of the operator is equivalent to strict convexity of s(x), and with consideration to mesh connectivity, this equivalence extends to discrete parameterisations over triangulated ...
متن کاملApproximation Algorithms for Tensor Clustering
We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common in modern applications dealing with complex heterogeneous data and clustering them is a fundamental tool for data analysis and pattern discovery. Akin to their 1D cousins, common tensor clustering formulations are NP-hard to opti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2019
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.201900386